0.06/0.12 % Problem : SLH624^1 : TPTP v7.5.0. Released v7.5.0. 0.06/0.13 % Command : run_E %s %d THM 0.12/0.34 % Computer : n004.cluster.edu 0.12/0.34 % Model : x86_64 x86_64 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.34 % Memory : 8042.1875MB 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.34 % CPULimit : 30 0.12/0.34 % WCLimit : 30 0.12/0.34 % DateTime : Tue Aug 9 03:16:20 EDT 2022 0.12/0.34 % CPUTime : 0.19/0.46 The problem SPC is TH0_THM_EQU_NAR 0.19/0.46 Running higher-order on 1 cores theorem proving 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.47 # Version: 3.0pre003-ho 1.86/2.10 # Preprocessing class: HSLSSMSSSSSNHSA. 1.86/2.10 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 1.86/2.10 # Starting full_lambda_9 with 30s (1) cores 1.86/2.10 # full_lambda_9 with pid 24660 completed with status 0 1.86/2.10 # Result found by full_lambda_9 1.86/2.10 # Preprocessing class: HSLSSMSSSSSNHSA. 1.86/2.10 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 1.86/2.10 # Starting full_lambda_9 with 30s (1) cores 1.86/2.10 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 1.86/2.10 # ...ProofStateSinE()=128/284 1.86/2.10 # Search class: HGUSM-FFLS32-MHSFFFNN 1.86/2.10 # partial match(2): HGUSM-FSLM32-MHSFFFNN 1.86/2.10 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 1.86/2.10 # Starting new_ho_10 with 17s (1) cores 1.86/2.10 # new_ho_10 with pid 24661 completed with status 0 1.86/2.10 # Result found by new_ho_10 1.86/2.10 # Preprocessing class: HSLSSMSSSSSNHSA. 1.86/2.10 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 1.86/2.10 # Starting full_lambda_9 with 30s (1) cores 1.86/2.10 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 1.86/2.10 # ...ProofStateSinE()=128/284 1.86/2.10 # Search class: HGUSM-FFLS32-MHSFFFNN 1.86/2.10 # partial match(2): HGUSM-FSLM32-MHSFFFNN 1.86/2.10 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 1.86/2.10 # Starting new_ho_10 with 17s (1) cores 1.86/2.10 # Preprocessing time : 0.003 s 1.86/2.10 # Presaturation interreduction done 1.86/2.10 1.86/2.10 # Proof found! 1.86/2.10 # SZS status Theorem 1.86/2.10 # SZS output start CNFRefutation 1.86/2.10 thf(decl_22, type, condit1627435690bove_a: (a > a > $o) > set_a > $o). 1.86/2.10 thf(decl_23, type, condit1001553558elow_a: (a > a > $o) > set_a > $o). 1.86/2.10 thf(decl_24, type, finite40241356em_a_a: (a > a > a) > $o). 1.86/2.10 thf(decl_25, type, finite_finite_a: set_a > $o). 1.86/2.10 thf(decl_26, type, abel_semigroup_a: (a > a > a) > $o). 1.86/2.10 thf(decl_27, type, semigroup_a: (a > a > a) > $o). 1.86/2.10 thf(decl_28, type, if_a: $o > a > a > a). 1.86/2.10 thf(decl_29, type, inf_inf_set_a: set_a > set_a > set_a). 1.86/2.10 thf(decl_30, type, semilattice_a: (a > a > a) > $o). 1.86/2.10 thf(decl_31, type, sup_sup_set_a: set_a > set_a > set_a). 1.86/2.10 thf(decl_32, type, lattic1885654924_set_a: (a > a > a) > $o). 1.86/2.10 thf(decl_33, type, modula17988509_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 1.86/2.10 thf(decl_34, type, modula1373251614_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 1.86/2.10 thf(decl_35, type, modula581031071_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 1.86/2.10 thf(decl_36, type, modula1936294176_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 1.86/2.10 thf(decl_37, type, modula1144073633_aux_a: (a > a > a) > (a > a > a) > a > a > a > a). 1.86/2.10 thf(decl_38, type, modula1727524044comp_a: (a > a > $o) > a > a > $o). 1.86/2.10 thf(decl_39, type, least_a: (a > a > $o) > (a > $o) > a). 1.86/2.10 thf(decl_40, type, max_a: (a > a > $o) > a > a > a). 1.86/2.10 thf(decl_41, type, min_a: (a > a > $o) > a > a > a). 1.86/2.10 thf(decl_42, type, ord_less_eq_set_a: set_a > set_a > $o). 1.86/2.10 thf(decl_43, type, greatest_a: (a > a > $o) > (a > $o) > a). 1.86/2.10 thf(decl_44, type, antimono_a_set_a: (a > a > $o) > (a > set_a) > $o). 1.86/2.10 thf(decl_45, type, mono_a_set_a: (a > a > $o) > (a > set_a) > $o). 1.86/2.10 thf(decl_46, type, collect_a: (a > $o) > set_a). 1.86/2.10 thf(decl_47, type, member_a: a > set_a > $o). 1.86/2.10 thf(decl_48, type, a2: a). 1.86/2.10 thf(decl_49, type, b: a). 1.86/2.10 thf(decl_50, type, c: a). 1.86/2.10 thf(decl_51, type, inf: a > a > a). 1.86/2.10 thf(decl_52, type, less_eq: a > a > $o). 1.86/2.10 thf(decl_53, type, sup: a > a > a). 1.86/2.10 thf(decl_54, type, esk1_1: (a > a > a) > a). 1.86/2.10 thf(decl_55, type, esk2_1: (a > a > a) > a). 1.86/2.10 thf(decl_56, type, esk3_1: (a > a > a) > a). 1.86/2.10 thf(decl_57, type, esk4_1: (a > a > a) > a). 1.86/2.10 thf(decl_58, type, esk5_1: (a > a > a) > a). 1.86/2.10 thf(decl_59, type, esk6_1: (a > a > a) > a). 1.86/2.10 thf(decl_60, type, esk7_1: (a > a > a) > a). 1.86/2.10 thf(decl_61, type, esk8_1: (a > a > a) > a). 1.86/2.10 thf(decl_62, type, esk9_1: (a > a > a) > a). 1.86/2.10 thf(decl_63, type, esk10_1: (a > a > a) > a). 1.86/2.10 thf(decl_64, type, esk11_1: (a > a > a) > a). 1.86/2.10 thf(decl_65, type, esk12_1: (a > a > a) > a). 1.86/2.10 thf(decl_66, type, esk13_1: (a > a > a) > a). 1.86/2.10 thf(decl_67, type, esk14_1: (a > a > a) > a). 1.86/2.10 thf(decl_68, type, esk15_0: a). 1.86/2.10 thf(decl_69, type, esk16_0: a). 1.86/2.10 thf(decl_70, type, esk17_0: a). 1.86/2.10 thf(decl_71, type, esk18_0: a). 1.86/2.10 thf(decl_72, type, esk19_0: a). 1.86/2.10 thf(decl_73, type, esk20_0: a). 1.86/2.10 thf(conj_1, conjecture, ((inf @ (modula581031071_aux_a @ inf @ sup @ a2 @ b @ c) @ (modula17988509_aux_a @ inf @ sup @ a2 @ b @ c))=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_1)). 1.86/2.10 thf(fact_14_local_Oinf_Ocommute, axiom, ![X4:a, X3:a]:(((inf @ X4 @ X3)=(inf @ X3 @ X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_14_local_Oinf_Ocommute)). 1.86/2.10 thf(fact_131_a__meet__b__eq__d, axiom, ![X4:a, X3:a, X9:a]:(((less_eq @ (modula1936294176_aux_a @ inf @ sup @ X4 @ X3 @ X9) @ (modula1144073633_aux_a @ inf @ sup @ X4 @ X3 @ X9))=>((inf @ (modula17988509_aux_a @ inf @ sup @ X4 @ X3 @ X9) @ (modula1373251614_aux_a @ inf @ sup @ X4 @ X3 @ X9))=(modula1936294176_aux_a @ inf @ sup @ X4 @ X3 @ X9)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_131_a__meet__b__eq__d)). 1.86/2.10 thf(fact_129_local_Ob__a, axiom, ![X4:a, X3:a, X9:a]:(((modula1373251614_aux_a @ inf @ sup @ X4 @ X3 @ X9)=(modula17988509_aux_a @ inf @ sup @ X3 @ X9 @ X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_129_local_Ob__a)). 1.86/2.10 thf(fact_101_local_Oc__a, axiom, ![X4:a, X3:a, X9:a]:(((modula581031071_aux_a @ inf @ sup @ X4 @ X3 @ X9)=(modula17988509_aux_a @ inf @ sup @ X9 @ X4 @ X3))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_101_local_Oc__a)). 1.86/2.10 thf(fact_87_local_Od__b__c__a, axiom, ![X3:a, X9:a, X4:a]:(((modula1936294176_aux_a @ inf @ sup @ X3 @ X9 @ X4)=(modula1936294176_aux_a @ inf @ sup @ X4 @ X3 @ X9))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_87_local_Od__b__c__a)). 1.86/2.10 thf(fact_93_local_Oe__b__c__a, axiom, ![X3:a, X9:a, X4:a]:(((modula1144073633_aux_a @ inf @ sup @ X3 @ X9 @ X4)=(modula1144073633_aux_a @ inf @ sup @ X4 @ X3 @ X9))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_93_local_Oe__b__c__a)). 1.86/2.10 thf(conj_0, hypothesis, (less_eq @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 1.86/2.10 thf(c_0_8, negated_conjecture, ((inf @ (modula581031071_aux_a @ inf @ sup @ a2 @ b @ c) @ (modula17988509_aux_a @ inf @ sup @ a2 @ b @ c))!=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])])). 1.86/2.10 thf(c_0_9, plain, ![X737:a, X738:a]:(((inf @ X737 @ X738)=(inf @ X738 @ X737))), inference(variable_rename,[status(thm)],[fact_14_local_Oinf_Ocommute])). 1.86/2.10 thf(c_0_10, plain, ![X688:a, X689:a, X690:a]:((~(less_eq @ (modula1936294176_aux_a @ inf @ sup @ X688 @ X689 @ X690) @ (modula1144073633_aux_a @ inf @ sup @ X688 @ X689 @ X690))|((inf @ (modula17988509_aux_a @ inf @ sup @ X688 @ X689 @ X690) @ (modula1373251614_aux_a @ inf @ sup @ X688 @ X689 @ X690))=(modula1936294176_aux_a @ inf @ sup @ X688 @ X689 @ X690)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_131_a__meet__b__eq__d])])). 1.86/2.10 thf(c_0_11, plain, ![X787:a, X788:a, X789:a]:(((modula1373251614_aux_a @ inf @ sup @ X787 @ X788 @ X789)=(modula17988509_aux_a @ inf @ sup @ X788 @ X789 @ X787))), inference(variable_rename,[status(thm)],[fact_129_local_Ob__a])). 1.86/2.10 thf(c_0_12, negated_conjecture, ((inf @ (modula581031071_aux_a @ inf @ sup @ a2 @ b @ c) @ (modula17988509_aux_a @ inf @ sup @ a2 @ b @ c))!=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)), inference(split_conjunct,[status(thm)],[c_0_8])). 1.86/2.10 thf(c_0_13, plain, ![X2:a, X1:a]:(((inf @ X1 @ X2)=(inf @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_9])). 1.86/2.10 thf(c_0_14, plain, ![X784:a, X785:a, X786:a]:(((modula581031071_aux_a @ inf @ sup @ X784 @ X785 @ X786)=(modula17988509_aux_a @ inf @ sup @ X786 @ X784 @ X785))), inference(variable_rename,[status(thm)],[fact_101_local_Oc__a])). 1.86/2.10 thf(c_0_15, plain, ![X1:a, X2:a, X3:a]:((((inf @ (modula17988509_aux_a @ inf @ sup @ X1 @ X2 @ X3) @ (modula1373251614_aux_a @ inf @ sup @ X1 @ X2 @ X3))=(modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3))|~((less_eq @ (modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3) @ (modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_10])). 1.86/2.10 thf(c_0_16, plain, ![X3:a, X2:a, X1:a]:(((modula1373251614_aux_a @ inf @ sup @ X1 @ X2 @ X3)=(modula17988509_aux_a @ inf @ sup @ X2 @ X3 @ X1))), inference(split_conjunct,[status(thm)],[c_0_11])). 1.86/2.10 thf(c_0_17, negated_conjecture, ((inf @ (modula17988509_aux_a @ inf @ sup @ a2 @ b @ c) @ (modula581031071_aux_a @ inf @ sup @ a2 @ b @ c))!=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)), inference(rw,[status(thm)],[c_0_12, c_0_13])). 1.86/2.10 thf(c_0_18, plain, ![X1:a, X3:a, X2:a]:(((modula581031071_aux_a @ inf @ sup @ X1 @ X2 @ X3)=(modula17988509_aux_a @ inf @ sup @ X3 @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_14])). 1.86/2.10 thf(c_0_19, plain, ![X1:a, X2:a, X3:a]:((((inf @ (modula17988509_aux_a @ inf @ sup @ X1 @ X2 @ X3) @ (modula17988509_aux_a @ inf @ sup @ X2 @ X3 @ X1))=(modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3))|~((less_eq @ (modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3) @ (modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3))))), inference(rw,[status(thm)],[c_0_15, c_0_16])). 1.86/2.10 thf(c_0_20, plain, ![X778:a, X779:a, X780:a]:(((modula1936294176_aux_a @ inf @ sup @ X778 @ X779 @ X780)=(modula1936294176_aux_a @ inf @ sup @ X780 @ X778 @ X779))), inference(variable_rename,[status(thm)],[fact_87_local_Od__b__c__a])). 1.86/2.10 thf(c_0_21, plain, ![X673:a, X674:a, X675:a]:(((modula1144073633_aux_a @ inf @ sup @ X673 @ X674 @ X675)=(modula1144073633_aux_a @ inf @ sup @ X675 @ X673 @ X674))), inference(variable_rename,[status(thm)],[fact_93_local_Oe__b__c__a])). 1.86/2.10 thf(c_0_22, negated_conjecture, ((inf @ (modula17988509_aux_a @ inf @ sup @ a2 @ b @ c) @ (modula17988509_aux_a @ inf @ sup @ c @ a2 @ b))!=(modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c)), inference(rw,[status(thm)],[c_0_17, c_0_18])). 1.86/2.10 thf(c_0_23, plain, ![X1:a, X3:a, X2:a]:((((inf @ (modula17988509_aux_a @ inf @ sup @ X1 @ X2 @ X3) @ (modula17988509_aux_a @ inf @ sup @ X3 @ X1 @ X2))=(modula1936294176_aux_a @ inf @ sup @ X3 @ X1 @ X2))|~((less_eq @ (modula1936294176_aux_a @ inf @ sup @ X3 @ X1 @ X2) @ (modula1144073633_aux_a @ inf @ sup @ X3 @ X1 @ X2))))), inference(spm,[status(thm)],[c_0_13, c_0_19])). 1.86/2.10 thf(c_0_24, plain, ![X1:a, X3:a, X2:a]:(((modula1936294176_aux_a @ inf @ sup @ X1 @ X2 @ X3)=(modula1936294176_aux_a @ inf @ sup @ X3 @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_20])). 1.86/2.10 thf(c_0_25, plain, ![X1:a, X3:a, X2:a]:(((modula1144073633_aux_a @ inf @ sup @ X1 @ X2 @ X3)=(modula1144073633_aux_a @ inf @ sup @ X3 @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_21])). 1.86/2.10 thf(c_0_26, hypothesis, (less_eq @ (modula1936294176_aux_a @ inf @ sup @ a2 @ b @ c) @ (modula1144073633_aux_a @ inf @ sup @ a2 @ b @ c)), inference(split_conjunct,[status(thm)],[conj_0])). 1.86/2.10 thf(c_0_27, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24]), c_0_24]), c_0_24]), c_0_25]), c_0_25]), c_0_26])]), ['proof']). 1.86/2.10 # SZS output end CNFRefutation 1.86/2.10 # Parsed axioms : 284 1.86/2.10 # Removed by relevancy pruning/SinE : 156 1.86/2.10 # Initial clauses : 153 1.86/2.10 # Removed in clause preprocessing : 8 1.86/2.10 # Initial clauses in saturation : 145 1.86/2.10 # Processed clauses : 2172 1.86/2.10 # ...of these trivial : 245 1.86/2.10 # ...subsumed : 945 1.86/2.10 # ...remaining for further processing : 981 1.86/2.10 # Other redundant clauses eliminated : 82 1.86/2.10 # Clauses deleted for lack of memory : 0 1.86/2.10 # Backward-subsumed : 116 1.86/2.10 # Backward-rewritten : 12 1.86/2.10 # Generated clauses : 152604 1.86/2.10 # ...of the previous two non-redundant : 139692 1.86/2.10 # ...aggressively subsumed : 0 1.86/2.10 # Contextual simplify-reflections : 38 1.86/2.10 # Paramodulations : 152348 1.86/2.10 # Factorizations : 0 1.86/2.10 # NegExts : 0 1.86/2.10 # Equation resolutions : 82 1.86/2.10 # Propositional unsat checks : 0 1.86/2.10 # Propositional check models : 0 1.86/2.10 # Propositional check unsatisfiable : 0 1.86/2.10 # Propositional clauses : 0 1.86/2.10 # Propositional clauses after purity: 0 1.86/2.10 # Propositional unsat core size : 0 1.86/2.10 # Propositional preprocessing time : 0.000 1.86/2.10 # Propositional encoding time : 0.000 1.86/2.10 # Propositional solver time : 0.000 1.86/2.10 # Success case prop preproc time : 0.000 1.86/2.10 # Success case prop encoding time : 0.000 1.86/2.10 # Success case prop solver time : 0.000 1.86/2.10 # Current number of processed clauses : 773 1.86/2.10 # Positive orientable unit clauses : 277 1.86/2.10 # Positive unorientable unit clauses: 8 1.86/2.10 # Negative unit clauses : 4 1.86/2.10 # Non-unit-clauses : 484 1.86/2.10 # Current number of unprocessed clauses: 137565 1.86/2.10 # ...number of literals in the above : 292091 1.86/2.10 # Current number of archived formulas : 0 1.86/2.10 # Current number of archived clauses : 207 1.86/2.10 # Clause-clause subsumption calls (NU) : 43957 1.86/2.10 # Rec. Clause-clause subsumption calls : 35245 1.86/2.10 # Non-unit clause-clause subsumptions : 850 1.86/2.10 # Unit Clause-clause subsumption calls : 567 1.86/2.10 # Rewrite failures with RHS unbound : 0 1.86/2.10 # BW rewrite match attempts : 1305 1.86/2.10 # BW rewrite match successes : 155 1.86/2.10 # Condensation attempts : 2172 1.86/2.10 # Condensation successes : 0 1.86/2.10 # Termbank termtop insertions : 2560603 1.86/2.10 1.86/2.10 # ------------------------------------------------- 1.86/2.10 # User time : 1.531 s 1.86/2.10 # System time : 0.092 s 1.86/2.10 # Total time : 1.623 s 1.86/2.10 # Maximum resident set size: 2656 pages 1.86/2.10 1.86/2.10 # ------------------------------------------------- 1.86/2.10 # User time : 1.540 s 1.86/2.10 # System time : 0.092 s 1.86/2.10 # Total time : 1.632 s 1.86/2.10 # Maximum resident set size: 2000 pages 1.86/2.10 EOF